Location:
Search - nfa closure
Search list
Description: 输入一个正则表达式，可以使用： 小写字母或数字，表示终结符；*，闭包；+，并集；~，补集；E，空串；O，空集 然后程序将生成 相应的NFA，以及化简之后的DFA，最后再输入一个字符串，程序判断它是否满足该正则表达式-input is a regular expression, you can use : lowercase letters or numbers, said Fu end; * Closure; , And set; To complement the set; E, empty string; O, empty set procedures will then generate the corresponding NFA, and the simplification of the DFA after finally lose into a string, procedures judgment whether it is to meet the regular expression
Platform: |
Size: 175504 |
Author: 杨震原 |
Hits:
Description: 输入一个正则表达式，可以使用： 小写字母或数字，表示终结符；*，闭包；+，并集；~，补集；E，空串；O，空集 然后程序将生成 相应的NFA，以及化简之后的DFA，最后再输入一个字符串，程序判断它是否满足该正则表达式-input is a regular expression, you can use : lowercase letters or numbers, said Fu end;* Closure; , And set; To complement the set; E, empty string; O, empty set procedures will then generate the corresponding NFA, and the simplification of the DFA after finally lose into a string, procedures judgment whether it is to meet the regular expression
Platform: |
Size: 249856 |
Author: 杨震原 |
Hits:
Description: 从NFA到DFA的转换过程是利用NFA的信息不断生成DFA的状态结点和边的过程，或者说是生成DFA自动机转换表元素的过程。求ε-闭包也就是把用ε边连接起来的状态合并起来的过程，被合并的状态集将形成DFA的一个状态，因此DFA的状态被表示为NFA的状态子集。
用SS(状态集)的形式表示DFA的状态。假设SS表示新产生的状态，则下一步的工作是：对每个符号a考虑其边和该边的指向状态。
-From the NFA to DFA conversion process is the use of information continuously generated NFA state DFA nodes and edges of the process, or to generate automata DFA conversion table of the process elements. Ε-closure order is to connect with ε while the status of the process of merging, the merger will form the state set a state of DFA, the DFA state is expressed as a subset of the state of NFA. With SS (state set) of the form of the state DFA. SS assumptions that the status of the newly elected, the next step is: for each symbol a consideration of its edge and the edge point to state.
Platform: |
Size: 210944 |
Author: 董华鹏 |
Hits:
Description: 把NFA确定化为DFA 的算法，实现将给定的NFA M，确定化为DFA M’，然后将DFA M状态最少化，将给定的DFA M的有限状态集S划分成若干互不相交的子集，使得：任何不同的两个子集中的状态都是可区别的，而同一子集中的任何两个状态都是等价的（要利用Ia函数，但并不需要构造ε-CLOSURE函数，因这是DFA）。输出化简后的DFA M’。
-NFA into a DFA to determine the algorithm to achieve a given NFA M, to determine into a DFA M ' , then the DFA M state minimization, given DFA M of finite state set S is divided into several disjoint subset, such that: any two different subset of the state are distinguishable, and the same subset of any two states are equivalent (to take advantage of Ia function, but does not need to construct ε-CLOSURE function, because This is a DFA). Output of the simplified DFA M ' .
Platform: |
Size: 2048 |
Author: 王静晓 |
Hits:
Description: 设计题目：把NFA确定化为DFA 的算法实现
设计内容及要求：构造一程序，实现：将给定的NFA M(其状态转换矩阵及初态、终态信息保存在指定文件中)，确定化为DFA M’。（要先实现ε-CLOSURE函数和Ia函数）。输出DFA M’(其状态转换矩阵及初态、终态信息保存在指定文件中)。
-Design: the NFA into a DFA algorithm to determine the content and requirements of the design: structure a program to achieve: the given NFA M (its state transition matrix and the initial state, the final state information is saved in the specified file), determination of the the DFA M ' . (First to achieve ε-CLOSURE functions and Ia function). Output DFA M ' (its state transition matrix and the initial state, the final state information is saved in the specified file).
Platform: |
Size: 111616 |
Author: DZ |
Hits:
Description: NFA转换为DFAjava版，功能齐全，求闭包，子集法-NFA converted DFAjava version, fully functional, seeking closure, a subset of the law
Platform: |
Size: 116736 |
Author: 谭婷婷 |
Hits: